Functionally recursive groups
نویسنده
چکیده
This document describes the package FR, which implements in GAP the basic objects of Mealy machines and functional recursions; and handles groups that they generate. Groups defined by a recursive action on a rooted tree can be defined in GAP via their recursion. Various algorithms are implemented to manipulate these groups and their elements. For comments or questions on FR please contact the author; this package is still under development.
منابع مشابه
The word and order problems for self-similar and automata groups
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
متن کاملApplying Differential Transform Method on the Effect of the Elastic Foundation on the out - Plane Displacement of the Functionally Graded Circular Plates
In this paper, the effect of elastic foundation on the out of plane displacement of functionally graded circular plates using differential transform method is presented. Differential transform method is a semi-analytical-numerical solution technique that is capable to solve various types of differential equations. Using this method, governing differential equations are transformed into recursiv...
متن کاملFunctionally recursive rings of matrices-Two examples
We define the notions of finite-state and functionally recursive matrices and their growth. We also introduce two rings generated by functionally recursive matrices. The first is isomorphic to the 2-generated free ring. The second is a 2-generated monomial ring such that the multiplicative semigroup of monomials in the generators is nil of degree 5 and the ring has Gelfand Kirillov dimension 1 ...
متن کاملResolving the Infinitude Controversy
A simple inductive argument shows natural languages to have infinitly many sentences, but workers in the field have uncovered clear evidence of a diverse group of ‘exceptional’ languages from Proto-Uralic to Dyirbal and most recently, Pirahã, that appear to lack recursive devices entirely. We argue that in an information-theoretic setting non-recursive natural languages appear neither exception...
متن کاملCollision Detection of Functionally Defined Objects for Constant Time
The problem of collision detection of functionally defined objects based on perturbation functions for constant time is considered. The collision detection algorithm of different complexity during a constant time is discussed. Recursive object space subdivision algorithm is proposed. In the perturbation function representation, collision detection becomes trivial due to the inside/outside prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007